A DNC function that computes no effectively bi-immune set
نویسندگان
چکیده
منابع مشابه
A DNC function that computes no effectively bi-immune set
In Diagonally Non-Computable Functions and Bi-Immunity [2], Carl Jockusch and Andrew Lewis-Pye proved that every DNC function computes a bi-immune set. They asked whether every DNC function computes an effectively bi-immune set. We construct a DNC function that computes no effectively bi-immune set, thereby answering their question in the negative.
متن کاملA retinal circuit that computes object motion.
Certain ganglion cells in the retina respond sensitively to differential motion between the receptive field center and surround, as produced by an object moving over the background, but are strongly suppressed by global image motion, as produced by the observer's head or eye movements. We investigated the circuit basis for this object motion sensitive (OMS) response by recording intracellularly...
متن کاملAlmost Every Set in Exponential Time is P-Bi-Immune
A set A is P-bi-immune if neither A nor its complement has an innnite subset in P. We investigate here the abundance of P-bi-immune languages in linear-exponential time (E). We prove that the class of P-bi-immune sets has measure 1 in E. This implies thatàlmost' every language in E is P-bi-immune, that is to say, almost every set recognizable in linear exponential time has no algorithm that rec...
متن کاملA Neural Network Architecture That Computes Its Own Reliability
~emical reactors, distillation columns, ~gineering science. Jity, safety, scheduling) lication of computing to one or more nputer methods and programs. Others I methods. Comparisons of alternative , and significant computing developed should describe in reasonable detail Yherever possible the authors should ity suitable for chemical engineering ,the methods are oriented to chemical ion. or Cont...
متن کاملDiagonally non-computable functions and fireworks
A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be negligible, for example the Turing upper-cone of a non-computable real, the class of coherent completions of Peano Arithmetic or the class of reals of minimal degrees. One class of particular interest in the study of neg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2015
ISSN: 0933-5846,1432-0665
DOI: 10.1007/s00153-015-0425-z